Gauss's 2F1(1) cannot be generalized to 2F1(x)
نویسندگان
چکیده
منابع مشابه
Gauss ’ s & 1 ) cannot be generalized to $ ‘ A x )
Zeilberger, D. Using ideas of Jet Wimp and Richard McIntosh, it is proved that Gauss's explicit evaluation of zFI(a, 6; c; 1) cannot be generalized to zFI(a, 6; c; x), for arbitrary a, b, c and X. A short proof of Wimp's theorem that asserts that 3Fz(a, b, c; d, e; 1) cannot be expressed in closed form is also given. As we all know, a geometric series is a series CO CA k, (1) k=O such that the ...
متن کاملHCI Cannot Be Used to Evaluate Art
Critiquing Art I agree with the workshop organizers that it is not constructive to evaluate interactive artwork under the same guidelines as traditional HCI work. There are often extremely divergent goals associated with artists and HCI researchers. Yes, there may be obvious parallels such as an artist that wants to insure that their work is correctly interpreted. However, art critique ≠ intera...
متن کاملQuantum Measurements Cannot be Proved to be Random
The postulates of quantum mechanics say that when a measurement is made on a quantum state the outcome of the measurement is random [1]. In classical physics, if the state of a closed system is known, then the state of that system is completely predictable. As far as we know, randomness only exists in quantum mechanics [2]. Everett proposed a purely unitary quantum theory [3] (without probabili...
متن کاملWhy Machines Cannot be
Mental processes are abstracted from a subset of the physical universe ; these, in turn, lead to the world of ideas. Although these ideas include quantum logic, no credible way has yet been found that constructs machines which use superimposed possibilities in the style of quantum logic, more general in computing power to machines based on classical logic. Machine theories are based exclusively...
متن کاملAggregating preferences cannot be fair
SOMMARIO/ABSTRACT Preferences typically define a partial ordering over outcomes. A number of formalisms like soft constraints and CP-nets exists to specify such partial or-derings. In situations involving multiple agents, we need to combine the preferences of several individuals. In this paper, we consider each agent as voting on whether they prefer one outcome to another. We prove that, under ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90211-f